Combinatorial Addition Formulas and Applications

نویسندگان

  • Pierre Auger
  • Gilbert Labelle
  • Pierre Leroux
چکیده

We derive addition formulas at the combinatorial level, that is equations of the form F (X1+ X2 + +Xk) = F (X1; X2; : : : ; Xk), where F = F (X) is a given combinatorial species and F is a species on k sorts of singletons X1; X2; : : : ; Xk; depending on F . General results are given in the case of a molecular species M = X=H. Speci c formulas are also presented in the cases of the species Ln of n-lists, Chan of n-chains, En of n-sets, E n of oriented n-sets, Cn of (oriented) n-cycles and Pn of n-gons (unoriented cyles). These formulas are useful for the computation of molecular expansions of species de ned by functional equations. Applications to the computation of cycle index series and asymmetry index series, to the extension of substitution to virtual species (and K-species), and to the analysis of generalized binomial coe cients M N k for molecular species are also given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some combinatorial aspects of finite Hamiltonian groups

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

متن کامل

Combinatorial formulas for Γ - coordinates in a totally

Postnikov constructed a decomposition of a totally nonnegative Grassmannian (Grkn)≥0 into positroid cells. We provide combinatorial formulas that allow one to decide which cell a given point in (Grkn)≥0 belongs to and to determine affine coordinates of the point within this cell. This simplifies Postnikov’s description of the inverse boundary measurement map and generalizes formulas for the top...

متن کامل

Combinatorial Proofs of Addition Formulas

In this paper we give a combinatorial proof of an addition formula for weighted partial Motzkin paths. The addition formula allows us to determine the LDU decomposition of a Hankel matrix of the polynomial sequence defined by weighted partial Motzkin paths. As a direct consequence, we get the determinant of the Hankel matrix of certain combinatorial sequences. In addition, we obtain an addition...

متن کامل

Combinatorial Formulas for Cohomology of Knot Spaces

We develop homological techniques for finding explicit combinatorial formulas for finite-type cohomology classes of spaces of knots in R, n ≥ 3, generalizing the Polyak—Viro formulas [9] for invariants (i.e., 0-dimensional cohomology classes) of knots in R. As the first applications, we give such formulas for the (reduced mod 2) generalized Teiblum—Turchin cocycle of order 3 (which is the simpl...

متن کامل

Asymptotic behaviour of associated primes of monomial ideals with combinatorial applications

Let  $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if  $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring  $R=K[x_1,ld...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001